package leetcode.string;

public interface SolutionService {

	//3.Longest Substring Without Repeating Characters
	int lengthOfLongestSubstring(String s);
	
	//5.Longest Palindromic Substring
	String longestPalindrome(String s);
	
	//8.String to Integer (atoi)
	int myAtoi(String str);
	
	//14.Longest Common Prefix
	String longestCommonPrefix(String[] strs);
	
	//20.Valid Parentheses
	boolean isValid(String s);
	
	//28.Implement strStr()
	int strStr(String haystack, String needle);
	
	//58.Length of Last Word
	int lengthOfLastWord(String s);
	
	//67.Add Binary
	String addBinary(String a, String b);
	
	//125.Valid Palindrome
	boolean isPalindrome(String s);

    /**
     * 290. Word Pattern
     * https://leetcode.com/problems/word-pattern/
     * @param pattern
     * @param str
     * @return
     */
    boolean wordPattern(String pattern, String str);
	
}
